翻訳と辞書 |
Prime k-tuple : ウィキペディア英語版 | Prime k-tuple
In number theory, a prime ''k''-tuple is a finite collection of values representing a repeatable pattern of differences between prime numbers. For a ''k''-tuple (''a'', ''b'', ...), the positions where the ''k''-tuple matches a pattern in the prime numbers are given by the set of integers ''n'' such that all of the values (''n'' + ''a'', ''n'' + ''b'', ...) are prime. Typically the first value in the ''k''-tuple is 0 and the rest are distinct positive even numbers.〔Chris Caldwell, ("The Prime Glossary: k-tuple" ) at The Prime Pages.〕 ==Named patterns== Several of the shortest ''k''-tuples are known by other common names:
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Prime k-tuple」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|